package rangeSumBST

// Definition for a binary tree node.
type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

func rangeSumBST2(root *TreeNode, low int, high int) int {
	p := root
	for {
		if p == nil {
			break
		}

	}
	return 0
}
